On-Orbit Operations Optimization by Leping Yang Yanwei Zhu Xianhai Ren & Yuanwen Zhang

Author:Leping Yang, Yanwei Zhu, Xianhai Ren & Yuanwen Zhang
Language: eng
Format: epub
Publisher: Springer New York, New York, NY

4.2.1 SQP Algorithm

To solve the constrained optimization problem, there are generally two kinds of approaches. One is to find the solution by the unconstrained optimization algorithm after previous disposal of constraints. In this approach, the key lies in choosing the penalty function and designing the penalty. However, it requires iteration and affords insufficient precision in equality constraint satisfaction. The other is to search for the optimal solution among all feasible ones, which is most typically represented by SQP. Previous applications show that SQP exhibits global convergence [1]. The basic principle of SQP is to transform the constrained optimization problem to a series of quadratic planning problems.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.